The general maximum matching algorithm of micali and vazirani
نویسندگان
چکیده
منابع مشابه
Set-merging for the Matching Algorithm of Micali and Vazirani
The algorithm of Micali and Vazirani [4] finds a maximum cardinality matching in time O( √ nm) if an efficient set-merging algorithm is used. The latter is provided by the incrementaltree set-merging algorithm of [2]. Details of this application to matching were omitted from [2] and are presented in this note.
متن کاملExtending Search Phases in the Micali-Vazirani Algorithm
The Micali-Vazirani algorithm is an augmenting path algorithm that offers the best theoretical runtime of O(n0.5m) for solving the maximum cardinality matching problem for non-bipartite graphs. This paper builds upon the algorithm by focusing on the bottleneck caused by its search phase structure and proposes a new implementation that improves efficiency by extending the search phases in order ...
متن کاملthe relationship between academic self-concept and academic achievement in english and general subjects of the students of high school
according to research, academic self-concept and academic achievement are mutually interdependent. in the present study, the aim was to determine the relationship between the academic self-concept and the academic achievement of students in english as a foreign language and general subjects. the participants were 320 students studying in 4th grade of high school in three cities of noor, nowshah...
Distributed algorithm for approximating the maximum matching
We present a distributed algorithm that finds a matching M of size which is at least 2/3|M | where M ∗ is a maximum matching in a graph. The algorithm runs in O(log n) steps.
متن کاملthe effect of translation versus matching words and definitions on retrieval of vocabulary among iranian intermediate efl learners
این تحقیق جهت بررسی تأثیر ترجمه در برابر ایجاد ارتباط بین لغات و ارائه معانی بر بازیابی واژگان در میان زبان آموزان متوسط ایرانی انجام شده است. به این منظور سه گروه کامل از دانش آموزان سطح متوسط که کتاب اینترچنج3 را مطالعه می کردند پس از انجام تست استاندارد مهارت سنجی انتخاب شدند. در ابتدا محقق آنها را به دو گروه آزمایشی و یک گروه کنترل یا شاهد تقسیم نمود و درمرحله بعد از کلیه دانش آموزان در سه ...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1988
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01762129